An efficient algorithm for damper optimization for linear vibrating systems using Lyapunov equation
نویسندگان
چکیده
منابع مشابه
An efficient algorithm for damper optimization for linear vibrating systems using Lyapunov equation
We consider a second order damped-vibration equation Mẍ + D(ε)ẋ + Kx = 0, where M, D(ε), K are real, symmetric matrices of order n. The damping matrix D(ε) is defined by D(ε) = Cu + C(ε), where Cu presents internal damping and rank(C(ε)) = r, where ε is dampers’ viscosity. We present an algorithm which derives a formula for the trace of the solution X of the Lyapunov equation AX + XA = −B, as a...
متن کاملAn Efficient Method for Estimating the Optimal Dampers' Viscosity for Linear Vibrating Systems Using Lyapunov Equation
This paper deals with an efficient algorithm for dampers’ viscosity optimization in mechanical systems. Our algorithm optimizes the trace of the solution of the corresponding Lyapunov equation using an iterative method which calculates a low rank Cholesky factor for the solution of the corresponding Lyapunov equation. We have shown that the new algorithm calculates the trace in O(m) flops per i...
متن کاملDamping Optimization for Linear Vibrating Systems Using Dimension Reduction
We consider a mathematical model of a linear vibrational system described by the second-order system of differential equations Mẍ +Dẋ+Kx = 0, where M, K and D are positive definite matrices, called mass, stiffness and damping, respectively. We are interested in finding an optimal damping matrix which will damp a certain part of the undamped eigenfrequencies. For this we use a minimization crite...
متن کاملAN EFFICIENT METAHEURISTIC ALGORITHM FOR ENGINEERING OPTIMIZATION: SOPT
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...
متن کاملAn Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O∗( √ T ) regret. The setting is a natural generalization of the non-stochastic multi-armed bandit problem, and the existence of an efficient optimal algorithm has been posed as an open problem in a number of recent papers. We show how the difficulties encountered b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2004
ISSN: 0377-0427
DOI: 10.1016/j.cam.2004.02.005